Discovering company revenue relations from news A network approach.
Large volumes of online business news provide an opportunity to explore various aspects of companies. A news story pertaining to a company often cites other companies. Using such company citations we construct an intercompany network, employ social network analysis techniques to identify a set of attributes from the network structure, and feed the attributes to machine learning methods to predict the company revenue relation (CRR) that is based on two companies ’ relative quantitative financial data. Hence, we seek to understand the power of network structural attributes in predicting CRRs that are not described in the news or known at the time the news was published. The network attributes produce close to 80 % precision, recall, and accuracy for all 87,340 company pairs in the network. This approach is scalable and can be extended to private and foreign companies for which financial data is unavailable or hard to procure.
Decision%2DTree%2DBased Knowledge Discovery Single%2D vs. Multi%2DDecision%2DTree Induction.

Interest%2Dbased personalized search.
Web search engines typically provide search results without considering user interests or context. We propose a personalized search approach that can easily extend a conventional search engine on the client side. Our mapping framework automatically maps a set of known user interests onto a group of categories in the Open Directory Project (ODP) and takes advantage of manually edited data available in ODP for training text classifiers that correspond to, and therefore categorize and personalize search results according to user interests. In two sets of controlled experiments, we compare our personalized categorization system (PCAT) with a list interface system (LIST) that mimics a typical search engine and with a nonpersonalized categorization system (CAT). In both experiments, we analyze system performances on the basis of the type of task and query length. We find that PCAT is preferable to LIST for information gathering types of tasks and for searches with short queries, and PCAT outperforms CAT in both information gathering and finding types of tasks, and for searches associated with free-form queries. From the subjects ’ answers to a questionnaire, we find that PCAT is perceived as a system that can find relevant Web pages quicker and easier
ServiceFinder A method towards enhancing service portals.

What are people searching on government web sites%3F
A study of search activity on the Utah.gov Web site. The U.S. government provides a large amount of information to the public on the Web. While the Freedom of Information Act requires the government and federal agencies to disclose a great deal of information to the public, the Paperwork Reduction Act allows these agencies to maintain and provide information through the Internet. Due in part to this Act, large amounts of government information have been put online and made publicly accessible. The provision of information was generally considered harmless before Sept. 11, 2001. After the terrorist attacks that day, the U.S. government and agencies became more concerned about what information was put online, and a lot of sensitive information was removed from the Web shortly thereafter. This includes reports on vulnerabilities related to plants and control measures, maps of power plants or water systems, emergency response plans, and so forth [4]. Terrorist access to such information can potentially
A decision support system for lower back pain diagnosis Uncertainty management and clinical evaluations.

Evaluating a decision support system for patient image pre%2Dfetching An experimental study.

A Data%2DMining%2DBased Prefetching Approach to Caching for Network Storage Systems.

Formulating the Data%2DFlow Perspective for Business Process Management.

Designing a better web portal for digital government a web%2Dmining based approach.

Intelligent image prefetching for supporting radiologists%27 primary reading a decision%2Drule inductive learning approach.

LinkSelector A Web mining approach to hyperlink selection for Web portals.
Please do not cite or quote without permissions from the authors. As the size and complexity of websites expands dramatically, it has become increasingly challenging to design websites on which web surfers can easily find the information they seek. In this paper, we address the design of the portal page of a website, which serves as the homepage of a website or a default web portal. We define a new and important research problem – hyperlink selection: selecting from a large set of hyperlinks in a given website a limited number of hyperlinks for inclusion in a portal page. The objective of hyperlink selection is to maximize the efficiency, effectiveness and usage of a web site’s portal page. We propose a heuristic approach to hyperlink selection, LinkSelector, which is based on relationships among hyperlinks – structural relationships that can be extracted from an existing website and access relationships that can be discovered from a web log. LinkSelector calculates preferences of hyperlinks and preferences of hyperlink sets from these relationships. Using these preferences, we develop and incorporate a clustering algorithm into LinkSelector to extract a limited number of hyperlinks from a large set of hyperlinks. We compared the performance of LinkSelector with that of the current practice of hyperlink selection (i.e., manual hyperlink selection by domain experts) and with data mining methods – classical hierarchical clustering and association rule mining, using data obtained from the University of Arizona website. Results showed that LinkSelector outperformed all of these. Specifically, the three major contributions of this paper are: − We have introduced and formally defined a new and important research problem-- hyperlink selection. − We have proposed and shown that a web mining based hyperlink selection approach, named LinkSelector, outperformed other hyperlink selection approaches − We have developed a new clustering algorithm and applied it to hyperlink selection. Applications of the algorithm are not limited to hyperlink selection. 1 1.
Analysis of the query logs of a Web site search engine.

LinkSelector A Web mining approach to hyperlink selection for Web portals.
Please do not cite or quote without permissions from the authors. As the size and complexity of websites expands dramatically, it has become increasingly challenging to design websites on which web surfers can easily find the information they seek. In this paper, we address the design of the portal page of a website, which serves as the homepage of a website or a default web portal. We define a new and important research problem – hyperlink selection: selecting from a large set of hyperlinks in a given website a limited number of hyperlinks for inclusion in a portal page. The objective of hyperlink selection is to maximize the efficiency, effectiveness and usage of a web site’s portal page. We propose a heuristic approach to hyperlink selection, LinkSelector, which is based on relationships among hyperlinks – structural relationships that can be extracted from an existing website and access relationships that can be discovered from a web log. LinkSelector calculates preferences of hyperlinks and preferences of hyperlink sets from these relationships. Using these preferences, we develop and incorporate a clustering algorithm into LinkSelector to extract a limited number of hyperlinks from a large set of hyperlinks. We compared the performance of LinkSelector with that of the current practice of hyperlink selection (i.e., manual hyperlink selection by domain experts) and with data mining methods – classical hierarchical clustering and association rule mining, using data obtained from the University of Arizona website. Results showed that LinkSelector outperformed all of these. Specifically, the three major contributions of this paper are: − We have introduced and formally defined a new and important research problem-- hyperlink selection. − We have proposed and shown that a web mining based hyperlink selection approach, named LinkSelector, outperformed other hyperlink selection approaches − We have developed a new clustering algorithm and applied it to hyperlink selection. Applications of the algorithm are not limited to hyperlink selection. 1 1.


A knowledge%2Dbased system for patient image pre%2Dfetching in heterogeneous database environments %2D modeling

Inductive Learning Approach to Intelligent Patient Image Pre%2Dfetching Extension and Evaluation of CN2 Algorithm.

Investigation of Factors Affecting Healthcare Organizations%27 Adoption of Telemedicine Technology.

Decision support for healthcare in a new information age.

Automated learning of patient image retrieval knowledge neural networks versus inductive decision trees.

Investigating Physician Acceptance of Telemedicine Technology A Survey Study in Hong Kong.

Analyzing the media usage behavior of telework groups a contingency approach.

A Study of Teleworkers%3F Media Use.

Neural Network Learning for Intelligent Patient%2DImage Retrieval.

An Adoption Model of Telework for Organizations.

Organizational Adoption and Diffusion of Technological Innovation A Comparative Case Study on Telemedicine in Hong Kong.

The Adequacy of Office Models.

Structured Design of a Knowledge%2DBased Message Dissemination System.

Guest Editors%27 Introduction Multimedia Information Systems.

An Entity%2DRelationship%2DBased Methodology for Distributed Database Design An Integrated Approach Towards Combined Logical and Distribution Designs.

An Object%2DOriented Methodology for Knowledge Base%2FDatabase Coupling.

Object%2DOriented Modeling and Design of Coupled Knowledge%2Dbase%2FDatabase Systems.

An Object%2DOriented Methodology for Knowledge Base%2FDatabase Coupling.

A multiple criteria model for the allocation of data files in a distributed information system.

Optimization of file migration policies in distributed computer systems.

Environment selection
this paper, I will discuss four major topics relating to current research in lexical semantics: methodology, descriptive coverage, adequacy of the representation, and the computational usefulness of representations. In addressing these issues, I will discuss what I think are some of the central problems facing the lexical semantics community, and suggest ways of best approaching these issues. Then, I will provide a method for the decomposition of lexical categories and outline a theory of lexical semantics embodying a notion of cocompositionality and type coercion, as well as several levels of semantic description, where the semantic load is spread more evenly throughout the lexicon. I argue that lexical decomposition is possible if it is performed generatively. Rather than assuming a fixed set of primitives, I will assume a fixed number of generative devices that can be seen as constructing semantic expressions. I develop a theory of Qualia Structure, a representation language for lexical items, which renders much lexical ambiguity in the lexicon unnecessary, while still explaining the systematic polysemy that words carry. Finally, I discuss how individual lexical structures can be integrated into the larger lexical knowledge base through a theory of lexical inheritance. This provides us with the necessary principles of global organization for the lexicon, enabling us to fully integrate our natural language lexicon into a conceptual whole
Integrating Expert Systems with Group Decision Support Systems.

Dynamic File Migration in Distributed Computer Systems.

An Object %2D Oriented Methodology for Database%2FKnowledgebase Coupling An Implementation of the Structured Entity Model in Nexpert System.

Analysis of Query Processing in Distributed Database Systems with Fully Replicated Files A Hierarchical Approach.

